Maximum Satisfiability
نویسنده
چکیده
The Boolean satisfiability problem (SAT) is the problem of deciding, given a Boolean expression in variables x1, · · · , xn, whether some assignment of the variables makes the expression true. SAT is historically notable because it was the first problem proven to be NP-complete. (Before this point, the idea of NP-completeness had been formulated, but no one had proven that there actually existed any NP-complete problems.) We will consider not arbitrary Boolean expressions but only expressions in conjunctive normal form (CNF), i.e. of the form
منابع مشابه
MSCG: Robust Core-Guided MaxSAT Solving
Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT) that finds a wide range of practical applications. This work describes and evaluates the Maximum Satisfiability using the Core-Guided approach solver (MSCG), which is a robust MaxSAT solver that participated in the MaxSAT Evaluation 2014.
متن کاملA Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem
In this paper we investigate the use of quantum particle swarm optimization (QPSO) principles to resolve the satisfiability problem. We describe QPSOSAT, a new iterative approach for solving the well known Maximum Satisfiability problem (MAX-SAT). This latter has been shown to be NP-hard if the number of variables per clause is greater than 3. The basic idea is to harness the optimization capab...
متن کاملBackbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...
متن کاملWeighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization
We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability problem.
متن کاملTight Bound on Johnson's Algorithm for Maximum Satisfiability
We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1 2, we show that the performance ratio is 2 3 and that this bound is tight. Moreover, we show that simple generalizations of Johnson's algorithm do not improve the pe...
متن کاملMinimum Satisfiability and Its Applications
We define solving techniques for theMinimum Satisfiability Problem (MinSAT), propose an efficient branch-and-bound algorithm to solve the Weighted Partial MinSAT problem, and report on an empirical evaluation of the algorithm onMin-3SAT,MaxClique, and combinatorial auction problems. Techniques solving MinSAT are substantially different from those for the Maximum Satisfiability Problem (MaxSAT)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006